A pr 2 00 9 Graphs with bounded tree - width and large odd - girth are almost bipartite
نویسندگان
چکیده
We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε.
منابع مشابه
2 00 9 Graphs with bounded tree - width and large odd - girth are almost bipartite Alexandr
We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε.
متن کاملGraphs with bounded tree-width and large odd-girth are almost bipartite
Article history: Received 15 April 2009
متن کاملHigh-Girth Graphs Avoiding a Minor are Nearly Bipartite
Let H be a xed graph. We show that any H-minor free graph of high enough girth has a circular-chromatic number arbitrarily close to two. Equivalently, such graphs have homomorphisms into a large odd circuit. In particular, graphs of high girth and of bounded genus or bounded tree width are \nearly bipartite" in this sense. For example, any planar graph of girth at least 16 admits a homomorphism...
متن کاملChordal bipartite graphs of bounded tree- and clique-width
A bipartite graph is chordal bipartite if every cycle of length at least six has a chord. In the class of chordal bipartite graphs the tree-width and the clique-width are unbounded. Our main results are that chordal bipartite graphs of bounded vertex degree have bounded tree-width and that k-fork-free chordal bipartite graphs have bounded clique-width, where a k-fork is the graph arising from a...
متن کاملOn the complexity of dominating set problems
The minimum all-ones problem and the connected odd dominating set problem were shown to be NP-complete in different papers for general graphs, while they are solvable in linear time (or trivial) for trees, unicyclic graphs, and series-parallel graphs. The complexity of both problems when restricted to bipartite graphs was raised as an open question. Here we solve both problems. For this purpose...
متن کامل